Black and White Bin Packing Revisited
نویسندگان
چکیده
منابع مشابه
Colorful Bin Packing
We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size si ∈ [0, 1] and a color ci ∈ C, where C is a set of colors (that is not necessarily known in advance). The total size of items packed into a bin cannot exceed its size, thus an item i can always be packed into a ...
متن کاملBin Packing with Multiple Colors
The Bin Packing problem is a classical optimization problem with many practical applications related to minimizing time or space. The Black and White Bin Packing problem is a variation proposed by Balogh et al. (2012), where we are given a set of items each with a weight and a color either white or black. We have an unlimited number of bins each with a weight limit and we assume that no item we...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملTwo-Bounded-Space Bin Packing Revisited
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...
متن کاملClass constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the...
متن کامل